Wavelet-based Lowpass/Bandpass Interpolation
ثبت نشده
چکیده
F9 l is described by, x9 l (t) = P n x(n)9l(t): Let Wl = Span f9l(t 0 n)g. Then, the interpolation with 9l(t) is easily seen to equivalent to the Wavelet-Galerkin approximation to the shift operator on L 2 (IR) restricted to Wl. Moreover, in the multiplicity M case, we have an ecient M-adic interpolation scheme, similar to the dyadic interpolation scheme discussed in Section. 2.. In this case, the if XJ (z) denotes the Z-transform of x8 0 (M 0J n), then, XJ (z) = XJ01(z M)H0(z) (33) where H0(z) is the autocorrelation of h0. Similar results hold in the case of all M 0 1 bandpass schemes too. The only change is that X1(z) = X(z M)Hl(z) in this case, where interpolation is being done with respect to 8l(t). The in-terpolatory classes are precisely described in the wavelet transform domain. F9 l = fx(t)jx(t) = W f (l; 0;) for some f 2 Wlg (34) where the multiplicity M DSWT is dened by, f (t)M j=2 l(M j t 0) dt (35) In the multiplicity M case too, the Fourier Transform of the scaling function ^ 90(!), satises ^ 90(0) = 1, and therefore from Eqn. 4, g(t) = ^ 90(2t) is also an interpolatory function. Fig. 4. shows the M-adic lowpass interpolation lter for M = 4, and length N = 16 scaling vector h0. The corresponding function 90(t) is shown in Fig. 4.
منابع مشابه
Thus Making the Recursion
X k=1 z 0k A0;k(z M)Mi01(z M): (41) This formula makes transparent exactly what happens in a recursive computation of the correlation functions. At every stage i, we have the Z-transform at points M 0i n of the appropriate function. In going to the (i + 1)st stage, the rst term Mi01(z M) ensures that values at the previous stage are retained at the even points, while the second term interpolate...
متن کاملFlexible Wavelet Transforms Using Lifting
Roger L. Claypoole, Jr. and Richard G. Baraniuk, Rice University Summary We introduce and discuss biorthogonal wavelet transforms using the lifting construction. The lifting construction exploits a spatial{domain, prediction{error interpretation of the wavelet transform and provides a powerful framework for designing customized transforms. We discuss the application of lifting to adaptive and n...
متن کاملA Fast and Efficient Computational Wavelet Transform Structure for the 2d Over-complete
We studied the computational complexity of the over-complete wavelet representation for the commonly used Spline wavelet family with an arbitrary order. By deriving a general expression for the complexity, it is shown that the inverse transform is significantly more costly in computation than the forward transform. In order to reduce the computational complexity, a new spatial implementation is...
متن کاملFast extraction of wavelet-based features from JPEG images for joint retrieval with JPEG2000 images
In this paper, some fast feature extraction algorithms are addressed for joint retrieval of images compressed in JPEG and JPEG2000 formats. In order to avoid full decoding, three fast algorithms that convert block-based discrete cosine transform (BDCT) into wavelet transform are developed, so that wavelet-based features can be extracted from JPEG images as in JPEG2000 images. The first algorith...
متن کاملDecimation for Bandpass Sigma-Delta Analog-to-Digital Conversion
An efficient means for constructing a narrow bandpass filter for an analogto-digital converter based on a bandpass sigma-delta modulator is presented. It is shown that the filter can be made with very simple hardware, comparable to that required by an analog-to-digital converter using standard lowpass sigma-delta modulation. Introduction Bandpass sigma-delta modulation [1] is a variant of the m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992